Method and device for turbo demodulation, iterative demapping and iterative decoding

ABSTRACT

The present invention concerns a method and device for demodulating received symbols using a turbo-demodulation scheme comprising an iterative de-mapping and wherein an iterative channel decoder is used in the turbo-demodulation scheme, characterized in that the iterative channel decoder performs a first iterative process named iterative decoding process, the turbo-demodulation performing a second iterative process named iterative demodulation and decoding process, at each iteration of the second iterative process, the iterative channel decoder executing plural iterations in order to decode bits from which symbols are derived from, and wherein the iterative channel decoder: memorizes at the end of the iterations of the first iterative process, the variables used internally by the iterative channel decoder, reads the memorized variables at the following iteration of the second iterative process.

TECHNICAL FIELD

The invention concerns a method for demodulating received symbols using a turbo-demodulation scheme comprising an iterative de-mapping and wherein an iterative channel decoder is used in the turbo-demodulation scheme.

BACKGROUND ART

Implementing a turbo-demodulation scheme is complex, especially when an iterative channel decoder is used in the turbo-demodulation scheme.

When a powerful iterative channel decoder is used, for example using a LDPC code, a convolutional turbo-code (CTC) or a block turbo-code (BTC), the decoders of these codes have in common to work according to the turbo principle. Internally some units, either implemented in hardware or software, exchange information in an iterative way.

SUMMARY OF INVENTION Technical Problem

For a LDPC code, it is classically considered generally that at least 50 iterations are needed to get good performances. For turbo-codes, between 4 and 8 decoding iterations are needed.

When such a turbo-channel-decoder is implemented inside a turbo-demodulation scheme, the complexity explodes. If 5 turbo iterations are used for the turbo-demodulation, with a LDPC decoder implementing 50 iterations inside, we get 250 LDPC iterations globally. The same reasoning can be used with turbo-codes.

Solution to Problem

The present invention aims at significantly decreasing the total number of decoding iterations, without any performance degradation.

The present invention concerns a method for demodulating received symbols using a turbo-demodulation scheme comprising an iterative de-mapping and wherein an iterative channel decoder is used in the turbo-demodulation scheme, characterized in that the iterative channel decoder performs a first iterative process named iterative decoding process, the turbo-demodulation performing a second iterative process named iterative demodulation and decoding process, at each iteration of the second iterative process, the iterative channel decoder executing plural iterations in order to decode bits from which symbols are derived from, and wherein the method comprises the steps executed by the iterative channel decoder of:

-   -   memorizing at the end of the iterations of the first iterative         process, the variables used internally by the iterative channel         decoder,     -   reading the memorized variables at the following iteration of         the second iterative process.

The present invention concerns also a device for demodulating received symbols using a turbo-demodulation scheme comprising an iterative de-mapping and wherein an iterative channel decoder is used in the turbo-demodulation scheme, characterized in that, the iterative channel decoder performs a first iterative process named iterative decoding process, the turbo-demodulation performing a second iterative process named iterative demodulation and decoding process, at each iteration of the second iterative process, the iterative channel decoder executing plural iterations in order to decode bits from which symbols are derived from, and wherein the iterative channel decoder comprises:

-   -   means for memorizing at the end of the iterations of the first         iterative process, the variables used internally by the         iterative channel decoder,     -   means for reading the memorized variables at the following         iteration of the second iterative process.

Thus, during the second and following iterations of the second iterative process, it is possible to reduce the number of decoding iterations without any loss in performance and thus it is possible to reduce the complexity of the receiver for the same performance or to improve performance for the same complexity.

For example, if the iterative channel decoder uses a LDPC code, the present invention needs only 5 to 20 iterations in order to get good performances.

For example, if the iterative channel decoder uses Convolutional turbo-codes, the present invention needs only between 1 to 3 iterations in order to get good performances, instead of 4 to 8 without the present invention.

According to a particular feature, the turbo-demodulation scheme comprises an iterative de-mapping.

Thus, performance is improved when the constellation order is large enough (at least two) and when the bit-to-constellation mapping is well selected.

According to a particular feature, the de-mapping scheme is performed taking into account a mapping scheme including a linear transformation following a previous one-dimensional or two-dimensional mapping function.

Thus, the diversity order of the mapping/de-mapping functions is increased and the performance is increased.

According to a particular feature, the received symbols are transferred by a source using Single-Carrier Frequency Division Multiple Access or orthogonal frequency division multiplex.

Thus, the complexity is further reduced, these two waveforms allowing a simplified implementation of the demodulation in the frequency domain.

According to a particular feature, the turbo-demodulation scheme comprises an iterative channel estimation.

Thus, performance of channel estimation is improved, which improves the receiver performance.

According to a particular feature, the iterative channel decoder receives from a controller messages indicating to the iterative channel decoder that iterative channel decoder has to read the memorized variables at the following iteration of the second iterative process or to reset the memorized variables.

Thus, the decoder uses the memory content when it is really needed only.

According to a particular feature, the turbo-demodulation and decoding scheme comprises a de-interleaving process based on a set of code blocks and in that the message further comprises the block identifier within the set of code blocks of the next block to be decoded.

Thus, the iterative channel decoder uses the memory content corresponding to the current code block.

According to a particular feature, the iterative channel decoder is a Low Density Parity Check decoder.

Thus, performance and/or complexity is improved, as DLPC decoder works in an iterative manner.

According to a particular feature, the iterative channel decoder is a Convolutional Turbo Code decoder.

Thus, performance and/or complexity is improved, as a Convolutional Turbo Code decoder works in an iterative manner.

According to a particular feature, the iterative channel decoder is a Block Turbo Code decoder.

Thus, performance and/or complexity is improved, as a Block Turbo Code decoder works in an iterative manner.

The present invention concerns also a computer program comprising program code instructions which can be loaded in a programmable device for implementing the method according to the first embodiment, when the program code instructions are run by the programmable device.

The present invention concerns also information storage means storing a computer program comprising program code instructions which can be loaded in a programmable device for implementing the method according to the first embodiment, when the program code instructions are run by the programmable device.

The characteristics of the present invention mentioned above, as well as other characteristics will appear more clearly on reading the following description of an example of an embodiment, said description being done in relation with the joint drawings, among which:

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates schematically an example of a communication system in which the invention may be implemented.

FIG. 2 illustrates schematically an example of a receiver in which the present invention may be implemented.

FIG. 3 represents an example of a hardware architecture of a wireless interface of the receiver in which the present invention may be implemented.

FIG. 4 represents an example of an algorithm executed by the control module according to the present invention.

FIG. 5 represents an example of an algorithm executed by the iterative channel decoder according to the present invention.

DESCRIPTION OF EMBODIMENTS

FIG. 1 illustrates schematically an example of a telecommunication system in which the invention can be implemented.

The telecommunication system comprises at least a source Src which transmits symbols to at least one receiver Rec.

The telecommunication system may be a 3GPP/LTE downlink wireless telecommunication system using Orthogonal Frequency Division Multiple (OFDM) or a 3GPP/LTE uplink wireless telecommunication system using Single-Carrier Frequency Division Multiple Access (SC-FDMA) or a broadcasting telecommunication network like DVB (Digital Video Broadcast) second generation digital terrestrial television broadcasting system (DVB-T2) system using OFDM.

OFDM is a multicarrier system.

SC-FDMA is a modulation scheme with OFDM-type multiplexing but single-carrier-like envelope. It can be implemented either in the time-domain (IFDMA) or in the frequency-domain. In the last case, it is also called DFT-spread OFDM, or SC-FDE (Single Carrier Frequency domain Equalisation) or SC-OFDM (Single Carrier Frequency Division Multiple Access). The present invention is applicable in any telecommunication system wherein an iterative demapping is needed and a channel decoder with an iterative decoding process is used. The mapping is the process that, at the transmitter part, converts bits into modulation symbols, for example belonging to a so-called constellation, for example QPSK, 16QAM or 8PSK constellations. The constellation set may be of dimension one, two or higher. This dimension is also called the constellation order. A constellation order greater than two may be obtained for example by applying a linear transformation to several elements with a lower dimension. The ‘linear transformation’ term must be understood in a wide sense, for example a linear transformation on the real coordinates of the input elements. For example, the modulation symbols may be further transformed by for example a rotation in the sense given in the DVB-T2 standard. These examples show that the term mapping shall be understood in the wide sense of converting a set of bits to a set of modulation symbols.

The demapping is the inverse function of the mapping function. From received modulation symbols, the demapping function provides an estimate of each corresponding transmitted bits. For example, these estimates consist in soft values. For example, these estimates correspond to LLR (Log Likelihood Ratio) of the bits. For example, the demapping function uses some knowledge about the transmission impairments, for example a signal-to-noise-ratio or channel estimates. In the so-called turbo-demapping process, and from the second iteration of this process, the demapping uses some a priori information corresponding to the external information provided by the channel decoder. The turbo-demapping will bring performance improvement if the mapping order is at least equal to two and if the global mapping function, i.e. including optional linear transformation or rotation, is well selected. A wide number of technical papers were written down on the selection of the mapping function. An important aspect in the present invention will bring an advantage as soon as turbo-demapping provides an advantage.

FIG. 2 illustrates schematically an example of a receiver in which the present invention may be implemented.

According to the shown architecture, the receiver Rec comprises the following components interconnected by a communication bus 201: a processor, microprocessor, microcontroller or CPU (Central Processing Unit) 200; a RAM (Random-Access Memory) 203; a ROM (Read-Only Memory) 202 and a wireless interface 205 connected to at least one antenna Ant.

The wireless interface 205 allows the receiver Rec to receive symbols.

CPU 200 is capable of executing instructions loaded into RAM 203 from ROM 202 or from an external memory. After the receiver Rec is powered on, CPU 200 is capable of reading instructions from RAM 203 and executing these instructions. The instructions form one computer program that causes CPU 200 to decode received symbols according to the present invention.

The decoding may be implemented in software by execution of a set of instructions or program by a programmable computing machine, such as a PC (Personal Computer), a DSP (Digital Signal Processor) or a microcontroller; or else implemented in hardware by a machine or a dedicated component, such as an FPGA (Field-Programmable Gate Array) or an ASIC (Application-Specific Integrated Circuit).

FIG. 3 represents an example of a hardware architecture of a wireless interface of the receiver in which the present invention may be implemented.

The example of hardware architecture given in FIG. 3 focuses on the invention characteristics. As already stated, the present invention founds applications in several contexts and therefore for several waveforms. Some details of possible waveforms, for example IDFT function for OFDM waveform, are omitted for generality and sake of simplicity.

The wireless interface 205 comprises a synchronization module 301, a control module 300, a demodulation module 302, a channel estimation module 303, a de-mapping module 304, an iterative channel decoder 308 which is associated to a memory 309, a subtracting module 311 and may comprise an interleaving module 310 and a de-interleaving module 305.

In the example of FIG. 3, the memory 309 is distinct from the iterative channel decoder 308. The memory 309 may be comprised in the iterative channel decoder 308.

The iterative channel decoder 308 is from a general point of view a turbo-decoder. A turbo decoder uses an iterative implementation of the decoding. The iterative channel decoder 308 performs a first iterative process named iterative decoding process.

The demodulation module 302, the de-mapping module 304, the iterative channel decoder 308, the subtracting module 311 and if there the interleaving module 310 and the de-interleaving module 307 form a second iterative process named iterative demodulation and decoding process. At each iteration of the second iterative process, the iterative channel decoder 308 executes plural iterations in order to decode bits.

The demodulation module 302, the de-mapping module 304, the de-interleaving module 305, the subtracting module 311 and the interleaving module 310 perform a demodulation process in the example of the present invention.

At the end of the first iterative process, the iterative channel decoder 308 provides extrinsic information used by the second iterative process in order to perform a demapping and according to particular features used by a channel estimation at the following step of the second iterative process.

Extrinsic information is for example a Log Likelihood Ratio (LLR) about the transmitted bits of the transmitted symbols.

The wireless interface 205 comprises then at least two interlinked iterative processes in order to decode receive symbols.

According to the invention, the iterative channel decoder 308 memorizes in a memory 309, at the end of the iterations of the first iterative process, the variables used by the iterative channel decoder 308 and reads the stored variables at the following iteration of the second iterative process.

The wireless interface 205 comprises the synchronization module 301 which provides synchronization information related to start of frames, start of blocks to a control module 300, to the demodulation module 302 and more generally such synchronization information to all modules which may need them. Here a frame corresponds to one or several codewords. When an interleaving is applied, we assume for simplicity of the description that a frame corresponds to one interleaving depth.

The control module 300, from the information received from the synchronization module 301, generates, according to the present invention a command signal indicating to the iterative channel decoder 308 if the iterative channel decoder 308 has to read in the memory 309 information previously stored in the memory 309, i.e. reuse the stored variables at a previous iteration or if the iterative channel decoder 308 has to reinitialize the stored variables in the memory 309.

The channel estimation module 303 may perform a first channel estimation by performing a preliminary and non perfect channel estimation, on some pilots or on data in a blind way, and may perform in the following iterations a channel estimation on pilots or data using in addition extrinsic information provided by the interleaving module 310 if there or by the subtracting module 311.

The output of the channel estimation module 303 is provided to the demodulation module 302 which performs a demodulation based on channel estimates and received symbols at first iteration and, from the second iteration, based on channel estimates, received symbols and the extrinsic information provided by the interleaving module 310 if there or by extrinsic information provided by the subtracting module 311.

The demodulation module 302 provides symbol estimations to the de-mapping module 304 and optionally to the channel estimation module 303 for a further improvement of the channel estimation. These symbol estimations correspond to soft estimates of the transmitted symbols, transmitted symbols belonging to the constellation alphabet. They may be accompanied by some information on the transmission impairments, for example a signal-to-noise ratio or the channel response estimations. This demodulation module 302 may include equalization, or may include a IDFT (inverse Digital Fourier Transform) if the system uses an OFDM waveform.

The de-mapping module 304 performs a de-mapping based on the output of the demodulation module 302 at first iteration and a turbo-demapping based on the output of the demodulation module 302 and the extrinsic information provided by the module 310 if there or by the subtracting module 311 from the second iteration of the second iterative process.

The output of the de-mapping module 304 consists in soft estimations like LLR and is provided if there to a de-interleaving module 305 which de-interleaves the soft estimations or if there is not a de-interleaving module 305 to the channel decoder 308 and to the subtracting module 311.

According to a particular feature, the de-mapping scheme is performed taking into account a mapping scheme including a linear transformation following a previous one-dimensional or two-dimensional mapping function.

The de-interleaving module 305 if there may de-interleave the soft estimations code block by code block or may de-interleave the soft estimations by set of code blocks if interleaving is performed on a set of code blocks.

A block corresponds to a codeword.

If there, the output of the de-interleaving module 305 is provided to the iterative channel decoder 308.

The iterative channel decoder 308 is for example a LDPC (Low Density Parity Check) decoder or a CTC (Convolutional Turbo Code) decoder or a BTC (Block Turbo Code) decoder.

LDPC codes are linear block codes, the syndrome matrix H of which being sparse. The sparse aspect means that parity equations only contain a relatively low number of variables, generally between 2 and 80, orders of magnitude lower than the size of the code block.

LDPC codes exhibit a performance extremely close to the best possible as determined by the Shannon capacity formula.

LDPC codes are well represented by bipartite graphs in which one set of nodes, the variable nodes, corresponds to elements of the codeword and the other set of nodes, the check nodes, corresponds to the set of parity-check constraints which define the code.

Variable nodes and check nodes exchange messages iteratively. A check node gets messages from its neighbour nodes, processes the messages, and sends the resulting messages back to its neighbour nodes. Neighbour nodes are the variable nodes which are involved in the corresponding check. Similarly, a variable node receives messages from its neighbour nodes, processes the messages, and sends messages back to its neighbour nodes. Here, neighbour nodes are the check nodes where the variable is involved. Each output message of a variable or a check node is a function of all incoming messages to the node except the incoming message from the neighbour node that the output message is sent to.

This two-step procedure is repeated many times. After n such iterations, each variable node decodes its associated bit based on all information obtained from neighbours and from the iterative decoder block input.

Classically, log-likelihood ratios (LLRs) are used as messages, i.e., we use

${L(v)} = {\log\frac{p\left( {\left. y \middle| x \right. = 0} \right)}{p\left( {\left. y \middle| x \right. = 1} \right)}}$

as the soft estimates representative of the bit x associated to the variable v.

At the i^(th) LDPC iteration:

${L^{i}\left( v\rightarrow c \right)} = {\log\frac{p\left( {\left. y_{c}^{i - 1} \middle| x \right. = 0} \right)}{p\left( {\left. y_{c}^{i - 1} \middle| x \right. = 1} \right)}}$

is the output message of a variable node v to a check node c, where x is the bit associated to the variable node and y_(c) ^(i-1) denotes all the information available to the node up to the present iteration obtained from edges other than the one corresponding to check node c. Therefore, the information sent from check node c to v at previous iteration (i−1) is omitted, in order to avoid always positive counter reaction.

At the first iteration, for starting of the decoding process, these values are equal to the a priori information available, i.e. the inputs L_(a) (v): L ¹(v→c)=L _(a)(v)∀v,c

Likewise, we define the output message of a check node as

${L^{i}\left( c\rightarrow v \right)} = {\log\frac{p\left( {\left. y_{v}^{i} \middle| x \right. = 0} \right)}{p\left( {\left. y_{v}^{i} \middle| x \right. = 1} \right)}}$

Where i is the iteration index, x is the bit associated to the variable node v that gets the message from the check node c, and y_(v) ^(i) denotes all the information available to the check node c up to the present iteration obtained from edges other than the one corresponding to v.

Under sum-product decoding, the message from a variable node to a check node is equal to the sum of all incoming LLRs, including a priori information, but excluding the previous message coming from this check node:

${L^{i}\left( v\rightarrow c \right)} = {{{L_{a}(v)} + {\sum\limits_{c^{\prime}{({c^{\prime} \neq c})}}{L^{i - 1}\left( c^{\prime}\rightarrow v \right)}}} = {{L_{a}(v)} + {L_{ext}^{i}(v)} - {L^{i - 1}\left( c\rightarrow v \right)}}}$

Where the extrinsic information associated to a variable v is defined as:

${L_{ext}^{i}(v)} = {\sum\limits_{c}{L^{i - 1}\left( c\rightarrow v \right)}}$

The message update rule for a check node c associated with d_(c) variables v_(j) can be obtained for example from the following equation: L ^(i)(c→v)=L ^(i)(v ₁ →c)(L ^(i)(v ₂ →c)( . . . (L ^(i)(v _(d) _(c) →c) excluding v _(j) =v

With the definition of the operation

$\left( \mspace{14mu}{{\text{:}\mspace{14mu}{\tanh\left( \frac{x\left( \mspace{14mu} y \right.}{2} \right)}} = {{\tanh\left( \frac{x}{2} \right)}{{\tanh\left( \frac{y}{2} \right)}.}}} \right.$

The operation (is commutative and associative, which allows a recursive implementation. For example, this operation can be implemented by: x(y=sgn(x)sgn(y)min(|x|,|y|)+ƒ(x+y)−ƒ(x−y)

The function ƒ is given by ƒ(u)=log(1+e^(−|u|))

It has to be noted here that a simplified version of the equation L^(i)(c→v) may be used.

According to the invention, each information L_(ext) (c→v) is stored in memory 309 at last iteration of the first iterative process and each information L_(ext) (c→v) is read at next iteration of the second iterative process for the same code block. Once the information is read, node c sends to each connected variable node v: L_(ext) (c→v).

The iterative channel decoder 308 is for example a CTC decoder. A CTC code consists in parallel concatenation of convolutional codes. Generally, two convolutional codes are used.

So-called turbo codes are known from a publication disclosed in Proc. 1993 IEEE International Conference of Communications, Geneva, Switzerland, pp 1064-1070 of May 1993 under the title “Near Shannon Limit Error-Correcting coding and decoding: Turbo-Codes”, the authors of which are Berrou C., Glavieux A. and Thitimajshima P.

These codes designate a set of error-correcting codes constituted by the concatenation in parallel of a number of Recursive Systematic Convolutional (RSC) codes, each elementary code being separated from the preceding one by means of an interleaving process.

The sequences coded in this way are decoded by an iterative method with weighted inputs and outputs commonly referred to as turbo decoding. Each turbo decoding iteration is composed of the association in series or parallel of elementary decoders each corresponding to an elementary code. The weighted information produced by each elementary decoder (referred to as extrinsic information) is de-interleaved and then propagated to the input of another elementary decoder. Therefore messages are exchanged between elementary convolutional decoders.

The fact that each elementary decoder generates its extrinsic information from only part of the available information (i.e. the bits related to the corresponding elementary encoder) justifies the iterative process: the extrinsic information is sent to another elementary decoder (in serial implementation, the second decoder within one iteration or the first one from one iteration to the next one) which updates its input information by adding the extrinsic information of the previous decoder. One decoding iteration is made of the concatenation (or parallel processing in a parallel implementation) of the elementary decoders (2 in the case of two dimensional turbo codes). From one decoding to the next one, the amplitude of the extrinsic information increases, i.e. the estimation of the decoded bits becomes more and more reliable. Equivalently, a performance gain is achieved from one iteration to the next one. After several iterations, the amplitude of the extrinsic information does not change: all available information is “exhausted” and the algorithm has converged.

For example, by assuming two (n) elementary codes and that the decoding is performed serially, the extrinsic information coming from the second (n^(th)) decoder is stored in memory at last iteration of the first iterative process and each extrinsic information is read at next iteration of the second iterative process for the same block. In case the decoding is performed in parallel on the two (n) decoders, the extrinsic information coming from both or all decoders is stored in memory at last iteration of the first iterative process and each variable extrinsic information is read at next iteration of the second iterative process for the same block.

The iterative channel decoder 308 is for example a block turbo decoder (BTC).

BTC codes consist in serial concatenation of short block-codes and need an iterative decoding.

Generally, data are represented in a matrix. Each line is encoded by an elementary linear block code and then each column is encoded by the same or another elementary linear block code.

In the iterative decoder, messages are exchanged between decoders on horizontal dimension and decoders on vertical dimension.

This implies that soft input soft output decoders are used for the elementary short codes.

By assuming that decoding is performed first on horizontal dimension, the extrinsic information coming from decoders on vertical dimension is stored in memory at last iteration of the first iterative process and each extrinsic information coming from decoders on vertical dimension is read for decoding on horizontal dimension at next iteration of the second iterative process for the same block.

If there is an interleaving module 310 and a de-interleaving module 305, the output of the iterative channel decoder 308 is outputted as the decoded symbols and provided to the processor 200, to the subtracting module 311 which subtracts the output of the de-interleaving module to the output of the iterative channel decoder 308.

The output of the subtracting module 311 so-called extrinsic information is provided to the interleaving module 310 which performs a reverse process as the one performed by the de-interleaving module 305.

The output of the interleaving module 310 is provided to the de-mapping module 304, optionally to the demodulation module 302 and to the channel estimation module 303.

If there is no interleaving module 310 and de-interleaving module 305, the output of the iterative channel decoder 308 is outputted as the decoded symbols and provided to the processor 200, to the subtracting module 311 which subtracts the output of the de-mapping module 304 to the output of the iterative channel decoder 308.

The output of the subtracting module 311 so-called extrinsic information is provided to the de-mapping module 304, optionally to the demodulation module 302 and to the channel estimation module 303.

FIG. 4 represents an example of an algorithm executed by the control module according to the present invention.

At step S40, for example at the beginning of a new equalization iteration, the control module 300 checks if a new code block or a new set of code blocks is received i.e. if a new frame is received. The control module 300 receives, from the synchronization module 301, information related to start of frames and start of code blocks. The control module 300 is informed of state of each module of the wireless interface disclosed in reference to FIG. 3.

If a new block or a new set of blocks is received, the control module 300 moves to step S41. Otherwise, the control module 300 moves to step S42.

At step S42, the control module 300 transfers to the iterative channel decoder 308 a command signal indicating to the iterative channel decoder 308 that the iterative channel decoder 308 has to read in the memory 309 information previously stored in the memory 309, i.e. reuse the stored variables at a previous iteration.

If an interleaving is performed on a set of blocks and not on a unique block, the control module 300 transfers also a block index to be used by the channel decoder 308 for retrieving the stored variables at a previous iteration for the block the index is transferred.

After that, the control module 300 moves to step S43.

At step S41, the control module 300 transfers to the iterative channel decoder 308 a command signal indicating to the iterative channel decoder 308 that the iterative channel decoder 308 has to reinitialize the variables stored in the memory 309. If an interleaving is performed on a set of blocks and not a unique one, the control module 300 transfers also a block index to be used by the channel decoder 308 for determining in which part of memory 309 the extrinsic information must be stored at the end of the decoding process.

After that, the control module 300 moves to step S43.

At next step S43, the control module 300 checks if the iterative decoding by the channel decoder 308 for the currently processed code block ends.

If the iterative decoding by the channel decoder 308 ends, the processor 300 moves to step S40. Otherwise, the processor 300 returns to step S43.

FIG. 5 represents an example of an algorithm executed by the iterative channel decoder according to the present invention.

At step S50, after having received from the control module 300 a message indicating that a new code block is available and that a decoding must begin the iterative channel decoder 308 checks if a command signal is received. This command signal is a ‘reuse’ or ‘not reuse’ command. The ‘reuse’ command signal indicates to the iterative channel decoder 308 that the iterative channel decoder 308 has to read in the memory 309 information previously stored in the memory 309, i.e. reuse the stored variables at a previous iteration.

If an interleaving is performed on a set of code blocks, the command signal further comprises also a block index to be used by the channel decoder 308. If a ‘reuse’ command is received, it will be used for retrieving the stored variables at a previous iteration for the block the index is transferred.

If a command signal indicates to the iterative channel decoder 308 that the iterative channel decoder 308 has to read in the memory 309 information previously stored in the memory 309, the iterative channel decoder 308 moves to step S51. Otherwise, the iterative channel decoder 308 moves to step S52.

At step S51, the iterative channel decoder 308 reads in the memory 309, each extrinsic information stored in memory 309 at last iteration of the first iterative process. If an interleaving is performed on a set of blocks, the iterative channel decoder 308 reads in the memory 309, each extrinsic information stored in memory 309 at last iteration of the first iterative process which correspond to the block the index of which is comprised in the control message.

If the iterative channel decoder 308 is a LDPC, the iterative channel decoder 308 reads in the memory 309 each variable L_(ext) (c→v) stored in memory 309 at last iteration of the first iterative process and each variable L_(ext) (c→v).

If the iterative channel decoder 308 is a LDPC and if the interleaving is performed on a set of blocks, the iterative channel decoder 308 reads in the memory 309, each variable L_(ext) (c→v) stored in memory 309 at last iteration of the first iterative process and each variable L_(ext) (c→v) which correspond to the block the index of which is comprised in the control message.

After that, the iterative channel decoder 308 moves to step S53.

At step S52, the iterative channel decoder 308 resets the extrinsic information stored in memory 309 at last iteration of the first iterative process, corresponding to the received code block index if an interleaving is performed on a set of blocks.

Once the extrinsic information is read or reset, the iterative channel decoder uses this information for decoding.

If the iterative channel decoder 308 is a LDPC, once the information is read, node c sends to each variable node v: L_(ext) (c→v) for the beginning of the decoding process of the currently decoded block.

After that, the iterative channel decoder 308 moves to step S53.

At step S53, the iterative channel decoder 308 starts a new iterative decoding. By reading in the memory 309 information previously stored in the memory 309 at previous iteration of the second iterative process for the same block, the present invention reduces drastically the number of iterations of the second iterative process and therefore reduces the complexity of the receiver.

At next step S54, the iterative channel decoder 308 checks if the last iteration of the first iterative process is executed.

If the last iteration of the first iterative process is executed, the iterative channel decoder 308 moves to step S55. Otherwise, the iterative channel decoder 308 returns to step S53.

At step S55, the iterative channel decoder 308 stores the internal extrinsic information in the memory 309.

If an interleaving is performed on a set of blocks, the iterative channel decoder 308 stores the internal extrinsic information in the memory 309 in a memory area dedicated to the block using the index received at step S50.

At next step S56, the iterative channel decoder 308 transfers the soft decoded information to the subtracting module 311 and to the processor 200. The soft decoded information is for example a Log Likelihood Ratio (LLR) about the transmitted bits of the transmitted symbols. 

The invention claimed is:
 1. A method for demodulating received symbols using a turbo-demodulation scheme comprising an iterative de-mapping and wherein an iterative channel decoder is used in the turbo-demodulation scheme, characterized in that the iterative channel decoder performs a first iterative process named iterative decoding process, the turbo-demodulation performing a second iterative process named iterative demodulation and decoding process, at each iteration of the second iterative process, the iterative channel decoder executing plural iterations in order to decode bits from which symbols are derived from, and wherein the method comprises the steps executed by the iterative channel decoder of: memorizing at the end of the iterations of the first iterative process, the variables used internally by the iterative channel decoder, receiving from a controller messages indicating to the iterative channel decoder that iterative channel decoder has to read the memorized variables at the following iteration of the second iterative process or to reset the memorized variables, reading the memorized variables at the following iteration of the second iterative process if a messages indicating to the iterative channel decoder that iterative channel decoder has to read the memorized variables at the following iteration of the second iterative process is received, and in that the turbo-demodulation scheme comprises a de-interleaving process based on a set of code blocks and the message further comprises a block identifier within the set of code blocks of the next block to be decoded.
 2. The method according to claim 1, characterized in that the received symbols are transferred by a source using Single-Carrier Frequency Division Multiple Access or an orthogonal frequency division multiplex.
 3. The method according to claim 1, characterized in that the de-mapping scheme is performed taking into account a mapping scheme including a linear transformation following a previous one-dimensional or two-dimensional mapping function.
 4. The method according to claim 1, characterized in that the turbo-demodulation scheme comprises an iterative channel estimation.
 5. The method according to claim 1, characterized in that the iterative channel decoder is a Low Density Parity Check decoder.
 6. The method according to claim 1, characterized in that the iterative channel decoder is a Convolutional Turbo Code decoder.
 7. The method according to claim 1, characterized in that the iterative channel decoder is a Block Turbo Code decoder.
 8. A device for demodulating received symbols using a turbo-demodulation scheme comprising an iterative de-mapping and wherein an iterative channel decoder is used in the turbo-demodulation scheme, characterized in that the iterative channel decoder performs a first iterative process named iterative decoding process, the turbo-demodulation performing a second iterative process named iterative demodulation and decoding process, at each iteration of the second iterative process, the iterative channel decoder executing plural iterations in order to decode bits from which symbols are derived from, and wherein the iterative channel decoder: memorizes at the end of the iterations of the first iterative process, the variables used internally by the iterative channel decoder, receives from a controller messages indicating to the iterative channel decoder that iterative channel decoder has to read the memorized variables at the following iteration of the second iterative process or to reset the memorized variables, reads the memorized variables at the following iteration of the second iterative process if a messages indicating to the iterative channel decoder that iterative channel decoder has to read the memorized variables at the following iteration of the second iterative process is received, and in that the turbo-demodulation scheme comprises a de-interleaving process based on a set of code blocks and the message further comprises a block identifier within the set of code blocks of the next block to be decoded. 